Degree distributions of bipartite networks and their projections
نویسندگان
چکیده
Bipartite (two-mode) networks are important in the analysis of social and economic systems as they explicitly show conceptual links between different types of entities. However, applications of such networks often work with a projected (one-mode) version of the original bipartite network. The topology of the projected network, and the dynamics that take place on it, are highly dependent on the degree distributions of the two different node types from the original bipartite structure. To date, the interaction between the degree distributions of bipartite networks and their one-mode projections is well understood for only a few cases, or for networks that satisfy a restrictive set of assumptions. Here we show a broader analysis in order to fill the gap left by previous studies. We use the formalism of generating functions to prove that the degree distributions of both node types in the original bipartite network affect the degree distribution in the projected version. To support our analysis, we simulate several types of synthetic bipartite networks using a configuration model where node degrees are assigned from specific probability distributions, ranging from peaked to heavy tailed distributions. Our findings show that when projecting a bipartite network onto a particular set of nodes, the degree distribution for the resulting one-mode network follows the distribution of the nodes being projected on to, but only so long as the degree distribution for the opposite set of nodes does not have a heavier tail. Furthermore, we show that bipartite degree distributions are not the only feature driving topology formation of projected networks, in contrast to what is commonly described in the literature.
منابع مشابه
The backbone of bipartite projections: Inferring relationships from co-authorship, co-sponsorship, co-attendance and other co-behaviors
The analysis and visualization of weighted networks pose many challenges, which have led to the development of techniques for extracting the network’s backbone, a subgraph composed of only the most significant edges. Weighted edges are particularly common in bipartite projections (e.g. networks of coauthorship, co-attendance, co-sponsorship), which are often used as proxies for one-mode network...
متن کاملFast extraction of the backbone of projected bipartite networks to aid community detection
This paper introduces a computationally inexpensive method of extracting the backbone of one-mode networks projected from bipartite networks. We show that the edge weights in one-mode projections are distributed according to a Poisson binomial distribution. Finding the expected weight distribution of a one-mode network projected from a random bipartite network only requires knowledge of the bip...
متن کاملBiology, Methodology or Chance? The Degree Distributions of Bipartite Ecological Networks
The distribution of the number of links per species, or degree distribution, is widely used as a summary of the topology of complex networks. Degree distributions have been studied in a range of ecological networks, including both mutualistic bipartite networks of plants and pollinators or seed dispersers and antagonistic bipartite networks of plants and their consumers. The shape of a degree d...
متن کاملHidden Variables in Bipartite Networks
We introduce and study random bipartite networks with hidden variables. Nodes in these networks are characterized by hidden variables that control the appearance of links between node pairs. We derive analytic expressions for the degree distribution, degree correlations, the distribution of the number of common neighbors, and the bipartite clustering coefficient in these networks. We also estab...
متن کاملLatent geometry of bipartite networks
Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.04953 شماره
صفحات -
تاریخ انتشار 2018